List total colorings of graphs
نویسندگان
چکیده
We introduce the concept of list total colorings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We also show that the total-choosability of a graph of maximum degree 2 is equal to its total chromatic number.
منابع مشابه
On Group Choosability of Total Graphs
In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures.We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs withou...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملDefective List Colorings of Planar Graphs
We combine the concepts of list colorings of graphs with the concept of defective colorings of graphs and introduce the concept of defective list colorings. We apply these concepts to vertex colorings of various classes of planar graphs. A defective coloring with defect d is a coloring of the vertices such that each color class corresponds to an induced subgraph with maximum degree at most d. A...
متن کاملThe Local Nature of List Colorings for Graphs of High Girth
We consider list coloring problems for graphs G of girth larger than c logΔ−1 n, where n and Δ ≥ 3 are, respectively, the order and the maximum degree of G, and c is a suitable constant. First, we determine that the edge and total list chromatic numbers of these graphs are χl(G) = Δ and χ′′ l (G) = Δ+1. This proves that the general conjectures of Bollobás and Harris (1985), Behzad and Vizing (1...
متن کاملColorings and Orientations of Matrices and Graphs
We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per(A[ζ|ξ]) of certain copies A[ζ|ξ] of a matrix A can be expressed as a weighted sum over the orientations or the colorings of A . When applied to incidence matrices of graphs these equations include Alon and Tarsi’s theorem about Eulerian orientations and the existence of list co...
متن کامل